bi-objective scheduling of no wait flexible flow lines with a time window and the possibility of work rejecting

نویسندگان

بابک اسلانی

کارشناس ارشد مدیریت صنعتی، دانشکده مدیریت و حسابداری، دانشگاه شهید بهشتی، تهران، ایران مصطفی زندیه

دانشیار گروه مدیریت دانشکده مدیریت و حسابداری، دانشگاه شهید بهشتی، تهران، ایران مجید عادلی

دانشجوی دکتری مدیریت تولید و عملیات، دانشکده مدیریت و حسابداری، دانشگاه شهید بهشتی، تهران، ایران

چکیده

one of the main challenges for manufacturers in production systems on order is balancing between orders, inputs and limited resources. hence, they have to choose some orders and reject the others. in addition, work schedule must be considered in order acceptance. in this research the integrated problem of scheduling and order acceptance in a no wait flexible flow line production system is discussed. in this study orders that can’t be delivered in due date are rejected . most researches are single objective optimization but in real world different objectives should be considered in the decision making. therefor a bi-objective model which maximizes profit and minimize delivery deviation, is presented. due to the high complexity of the model, the exact methods are not able to produce the optimal solution , so the two meta- heuristic algorithms mosa and nsga ii for this problem were developed and their performance were compared through quantitative indicators in three different categories.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

َA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times

This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...

متن کامل

Single Hoist Scheduling in No-Wait Flexible Flow Shop System

This paper studies the single hoist scheduling problem in no-wait flexible flow shop system with constant process times. The objective is to minimize the make span in the given job tasks. Different jobs have different process routes and process times. When a job starts, workstation must be free to process the job, and as soon as it is finished, the hoist must be free to move it to the next work...

متن کامل

Solving Re-entrant No-wait Flow Shop Scheduling Problem

In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...

متن کامل

The Bi-Objective Location-Routing Problem based on Simultaneous Pickup and Delivery with Soft Time Window

The location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optimum. Simultaneous pickup and delivery based on time windows are the two main characteristics of logistic management that have be...

متن کامل

A hybrid NSGA-II and VNS for solving a bi-objective no-wait flexible flowshop scheduling problem

We address the no-wait k-stage flexible flowshop scheduling problem where there are m identical machines at each stage. The objectives are to schedule the available n jobs so that makespan and mean tardiness of n jobs are minimized. Sequence-dependent setup times are treated in this problem as one of the prominent practical assumptions. This problem is NP-hard, and therefore we present a new mu...

متن کامل

َa multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times

this paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. this paper presen...

متن کامل

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023